Querying Disjunctive Databases in Polynomial Time∗
نویسندگان
چکیده
One of the major hurdles to implementing a practical disjunctive database is the CoNP-completeness of executing queries. We demonstrate, however, that this problem is similar to the problem of computing the transitive closure of a node in a disjunctive graph. While this problem is also CoNP-complete in general, we show in this paper that there is a polynomial-time solution that solves it for certain cases. We show how to apply this solution to the problem of querying disjunctive databases, allowing us to implement a practical disjunctive database for applications that satisfy the assumptions required for our polynomial-time algorithm.
منابع مشابه
Query Language Primitives for Programming with Incomplete Databases
We study the problem of choosing a suitable collection of primitives for querying databases with disjunctive information. Theoretical foundations for querying such databases have been developed in [11, 12]. The main tool for querying disjunctive information has come to be known under the name of normalization. In this paper we show how these theoretical results can lead to practical languages f...
متن کاملA Tractable Class of Disjunctive Deductive Databases
In general, computing answers to queries in disjunctive deductive databases is CoNP-complete and therefore computationally infeasible. However, there are some tractable classes of disjunctive databases. In this paper, we present polynomial time algorithms to compute answers to queries in one such tractable class of disjunctive databases where at most two atoms are allowed in any disjunction.
متن کاملImproved Bottom-Up Query Evaluation in Positive Disjunctive Databases
It is known that bottom-up query evaluation can be extended to work with disjunctive facts, but there seems to be the common assumption that it is much too ineecient for practical applications. In this paper, we improve the extended bottom-up evaluation by making the resolvable literal in a disjunctive fact unique. In many cases, this reduces an exponential behaviour to a polynomial one. We app...
متن کاملA Rational and Efficient Algorithm for View Deletion in Databases
In this paper, we show how techniques from disjunctive logic programming and classical first-order theorem proving can be used for efficient (deductive) database updates. The key idea is to tranform the given database together with the update request into a disjunctive logic program and apply disjunctive techniques (such as minimal model reasoning) to solve the original update problem. We prese...
متن کاملEecient Query Evaluation in Disjunctive Deductive Databases
It is known that bottom-up query evaluation can be extended to work with disjunctive facts, but there seems to be the common assumption that it is much too ineecient for practical applications. In this paper, we improve the extended bottom-up evaluation by making the resolvable literal in a disjunctive fact unique. In many cases, this reduces an exponential behaviour to a polynomial one. We int...
متن کامل